Approaching the Chasm at Depth Four
نویسندگان
چکیده
منابع مشابه
Arithmetic circuits: The chasm at depth four gets wider
In their paper on the “chasm at depth four”, Agrawal and Vinay have shown that polynomials in m variables of degree O(m) which admit arithmetic circuits of size 2 also admit arithmetic circuits of depth four and size 2. This theorem shows that for problems such as arithmetic circuit lower bounds or black-box derandomization of identity testing, the case of depth four circuits is in a certain sense
متن کاملArithmetic circuits: A chasm at depth three four
We show that, over Q, if an n-variate polynomial of degree d = nO(1) is computable by an arithmetic circuit of size s (respectively by an algebraic branching program of size s) then it can also be computed by a depth three circuit (i.e. a ΣΠΣ-circuit) of size exp(O( √ d log d log n log s)) (respectively of size exp(O( √ d log n log s))). In particular this yields a ΣΠΣ circuit of size exp(O( √ ...
متن کاملThe Chasm at Depth Four, and Tensor Rank : Old results, new insights
Agrawal and Vinay [AV08] showed how any polynomial size arithmetic circuit can be thought of as a depth four arithmetic circuit of subexponential size. The resulting circuit size in this simulation was more carefully analyzed by Korian [Koi12] and subsequently by Tavenas [Tav15]. We provide a simple proof of this chain of results. We then abstract the main ingredient to apply it to formulas and...
متن کاملRevisiting the quality chasm.
Strategic plans provide the roadmap by which organizations achieve their vision. To effectively serve as that roadmap, strategic plans must have certain essential characteristics. These include the ability to inspire and motivate while remaining action-oriented and understandable to all personnel. More than a decade ago, in Crossing the Quality Chasm, the Institute of Medicine (IOM) suggested o...
متن کاملA Note on Depth Reduction: A Simple Proof of the Chasm
Agrawal and Vinay [AV08] showed how any subexponential arithmetic circuit can be thought of as a depth four subexponential arithmetic circuit. This unexpected depth reduction to constant depth is in contrast to curcuits in the Boolean setting. The resulting circuit size in this simulation was more carefully analyzed by Korian [Koi12] and subsequently by Tavenas [Tav13]. We provide a simple proo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2014
ISSN: 0004-5411,1557-735X
DOI: 10.1145/2629541